2-stage robust MILP with continuous recourse variables
نویسندگان
چکیده
We solve a linear robust problem with mixed-integer first-stage variables and continuous second stage variables. We consider column wise uncertainty. We first focus on a problem with right hand-side uncertainty which satisfies a "full recourse property" and a specific definition of the uncertainty. We propose a solution based on a generation constraint algorithm. Then we give several generalizations of the approach: for left-hand side uncertainty, for the cases where the "full recourse property" is not satisfied and for uncertainty sets defined by a polytope.
منابع مشابه
A note on discrete robust optimization without the full recourse property
We denote, for all feasible x, by R(x) the associated robust problem when x is fixed, and we denote by R(x, d) the associated robust problem when x and d are fixed. In this note we assume that the deterministic problem doesn’t satisfied the full recourse property. We prove how to obtain a new MILP denoted (P̃ ) such that the robust associated problem has the same optimal solution as the initial ...
متن کاملStochastic Programming Model for Power Generation
We consider power system expansion planning under uncertainty. In our approach, integer programming and stochastic programming provide a basic framework. We develop a multistage stochastic programming model in which some of the variables are restricted to integer values. By utilizing the special property of the problem, called block separable recourse, the problem is transformed into a two-stag...
متن کاملSequential Cut Refinement Method in Multistage Stochastic Integer Programming: Application to a Unit Commitment Problem
2 Benders' method usually divides the collection of decision variables of a two-stage mathematical problem into two sets: a first set that comprises the collection of variables that represent first-stage decisions and a second set that includes the collection of variables that represent recourse actions or second-stage decisions. Usually, integer variables appear in the first set whereas the se...
متن کاملRobust Linear Optimization With Recourse
We propose an approach to linear optimization with recourse that does not involve a probabilistic description of the uncertainty, and allows the decision-maker to adjust the degree of robustness of the model while preserving its linear properties. We model random variables as uncertain parameters belonging to a polyhedral uncertainty set and minimize the sum of the first-stage costs and the wor...
متن کاملL-shaped Decomposition Method for Multi-stage Stochastic Concentrator Location Problem
A stochastic version of a concentrator location problem is dealt with in which traffic demand at each terminal location is uncertain. The concentrator location problem is defined as to determine the following: (i) the numbers and locations of concentators that are to be open, and (ii) the allocation of terminals to concentrator sites. The problem is formulated as a stochastic multi-stage intege...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 170 شماره
صفحات -
تاریخ انتشار 2014